Search results for "variational inequality"

On State Constrained Optimal Shape Design Problems

1987

This paper is concerned with the following optimal design problem with constraints both on the state and on the control: $$MinimizeJ(y,u)$$ (P) subject to $$A\left( u \right)y + \partial \varphi \left( y \right) \mathrel\backepsilon Bu + f,$$ (1.1) $$y \in K,$$ (1.2) $$u \in {U_{ad}}.$$ (1.3)

Biharmonic obstacle problem: guaranteed and computable error bounds for approximate solutions

2020

The paper is concerned with a free boundary problem generated by the biharmonic operator and an obstacle. The main goal is to deduce a fully guaranteed upper bound of the difference between the exact minimizer u and any function (approximation) from the corresponding energy class (which consists of the functions in $H^2$ satisfying the prescribed boundary conditions and the restrictions stipulated by the obstacle). For this purpose we use the duality method of the calculus of variations and general type error identities earlier derived for a wide class of convex variational problems. By this method, we define a combined primal--dual measure of error. It contains four terms of different natu…

Irregular Time Dependent Obstacles

2010

Abstract We study the obstacle problem for the Evolutionary p-Laplace Equation when the obstacle is discontinuous and does not have regularity in the time variable. Two quite different procedures yield the same solution.

Holder continuity of solutions for a class of nonlinear elliptic variational inequalities of high order

2001

Shape optimization for Stokes problem with threshold slip boundary conditions

2017

This paper deals with shape optimization of systems governed by the Stokes flow with threshold slip boundary conditions. The stability of solutions to the state problem with respect to a class of domains is studied. For computational purposes the slip term and impermeability condition are handled by a regularization. To get a finite dimensional optimization problem, the optimized part of the boundary is described by B´ezier polynomials. Numerical examples illustrate the computational efficiency. peerReviewed

Contact Shape Optimization

1995

Shape optimization is a branch of the optimal control theory in which the control variable is connected with the geometry of the problem. The aim is to find a shape from an a priori defined class of domains, for wich the corresponding cost functional attains its minimum. Shape optimization of mechanical systems, behaviour of which is described by equations, has been very well analyzed from the mathematical, as well as from the mechanical point of view, see [1], [2], [3] and references therein. The aim of this contribution is to extend results to the case, in which the system is described by the so called variational inequalities. There are two reasons for doing that: 1) The behavior of many…

Regularity of solutions of nonlinear variational inequalities

1973

Optimization of the domain in elliptic variational inequalities

1988

This paper is concerned with a nonsmooth shape optimization problem for the Signorini unilateral boundary-value problem. The necessary optimality conditions are derived. The results of computations are presented.

Best approximation and variational inequality problems involving a simulation function

2016

We prove the existence of a g-best proximity point for a pair of mappings, by using suitable hypotheses on a metric space. Moreover, we establish some convergence results for a variational inequality problem, by using the variational characterization of metric projections in a real Hilbert space. Our results are applicable to classical problems of optimization theory.

Quasi-nash equilibria for non-convex distributed power allocation games in cognitive radios

2013

In this paper, we consider a sensing-based spectrum sharing scenario in cognitive radio networks where the overall objective is to maximize the sum-rate of each cognitive radio user by optimizing jointly both the detection operation based on sensing and the power allocation, taking into account the influence of the sensing accuracy and the interference limitation to the primary users. The resulting optimization problem for each cognitive user is non-convex, thus leading to a non-convex game, which presents a new challenge when analyzing the equilibria of this game where each cognitive user represents a player. In order to deal with the non-convexity of the game, we use a new relaxed equilib…